package DynamicProgrammingPackage;

public class findLength_ {

    // 1. dp[i][j]表示以i - 1为结尾,j - 1为结尾的最长公共子序列
    public int findLength(int[] nums1, int[] nums2) {
        int[][] dp = new int[nums1.length + 1][nums2.length + 1];
        for (int i = 0; i <= nums1.length; i++) {
            dp[i][0] = 0;
        }
        for (int j = 0; j <= nums2.length; j++) {
            dp[0][j] = 0;
        }
        int maxValue = 1;
        for (int i = 1; i <= nums1.length; i++) {
            for (int j = 1; j <= nums2.length; j++) {
                if (nums1[i - 1] == nums2[j - 1]) {
                    dp[i][j] = dp[i - 1][j - 1] + 1;
                    maxValue = Math.max(maxValue, dp[i - 1][j - 1]);
                }
            }
        }
        return maxValue;
    }
}
